Christopher James Huff <cja### [at] earthlinknet> wrote:
> Can you give an example of one of these?

  I don't remember any. (Can quicksort be made iteratively?)

> How about a slight modification: You can make an iterative version of 
> any recursive algorithm that can be executed by a computer.

  There are algorithms which need a stack (which size is proportional
to the amount of loops done). These are recursive algorithms which can't
be done iteratively.

-- 
#macro N(D)#if(D>99)cylinder{M()#local D=div(D,104);M().5,2pigment{rgb M()}}
N(D)#end#end#macro M()<mod(D,13)-6mod(div(D,13)8)-3,10>#end blob{
N(11117333955)N(4254934330)N(3900569407)N(7382340)N(3358)N(970)}//  - Warp -

Post a reply to this message